'The Asymptotic Number of Connected d-Uniform Hypergraphs' - CORRIGENDUM
نویسندگان
چکیده
MICHAEL BEHRISCH1† , AMIN COJA-OGHLAN2‡ and MIHYUN KANG3§ 1 Institute of Transportation Systems, German Aerospace Center, Rutherfordstrasse 2, 12489 Berlin, Germany (e-mail: [email protected]) 2 Goethe University, Mathematics Institute, 60054 Frankfurt am Main, Germany (e-mail: [email protected]) 3 TU Graz, Institut für Optimierung und Diskrete Mathematik (Math B), Steyrergasse 30, 8010 Graz, Austria (e-mail: [email protected])
منابع مشابه
The Asymptotic Number of Connected d-Uniform Hypergraphs
For d ≥ 2, let Hd(n, p) denote a random d-uniform hypergraph with n vertices in which each of the ( n d ) possible edges is present with probability p = p(n) independently, and let Hd(n,m) denote a uniformly distributed d-uniform hypergraph with n vertices and m edges. Let either H = Hd(n,m) or H = Hd(n, p), where m/n and ( n−1 d−1 ) p need to be bounded away from (d− 1)−1 and 0 respectively. W...
متن کاملEnumeration of Connected Uniform Hypergraphs
In this paper, we are concerned in counting exactly and asymptotically connected labeled b-uniform hypergraphs (b ≥ 3). Enumerative results on connected graphs are generalized here to connected uniform hypergraphs. For this purpose, these structures are counted according to the number of vertices and hyperedges. First, we show how to compute step by step the associated exponential generating fu...
متن کاملPhase Transition of Random Non-uniform Hypergraphs
Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size t to belong to the hypergraph depends of a parameter ωt of the model. It is a natural generalization of the models of graphs used by Flajolet, Knuth and Pittel [1] and Janson, Knuth, Luczak and Pittel [...
متن کاملUniform Number of a Graph
We introduce the notion of uniform number of a graph. The uniform number of a connected graph $G$ is the least cardinality of a nonempty subset $M$ of the vertex set of $G$ for which the function $f_M: M^crightarrow mathcal{P}(X) - {emptyset}$ defined as $f_M(x) = {D(x, y): y in M}$ is a constant function, where $D(x, y)$ is the detour distance between $x$ and $y$ in $G$ and $mathcal{P}(X)$ ...
متن کاملTotal Transversals and Total Domination in Uniform Hypergraphs
In 2012, the first three authors established a relationship between the transversal number and the domination number of uniform hypergraphs. In this paper, we establish a relationship between the total transversal number and the total domination number of uniform hypergraphs. We prove tight asymptotic upper bounds on the total transversal number in terms of the number of vertices, the number of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 24 شماره
صفحات -
تاریخ انتشار 2015